【贪心算法】汽车加油问题

#include<iostream>
using namespace std;
#define N 1000
int d[N];

int main()
{
        int n,k,i,count,left;
        while(cin>>n>>k)
        {
                for(i=1;i<=k+1;i++)
                        cin>>d[i];
                for(i=1;i<=k+1;i++)
                {
                        if(d[i]>n)
                        {
                                cout<<"No Solution!"<<endl;
                                return 0;
                        }
                }
                count=0;
                left=n;
                for(i=1;i<=k;i++)
                {
                        left=left-d[i];
                        if(left<d[i+1])